Parsing Parallel Grammatical Representation
نویسنده
چکیده
Traditional accounts of quantifier scope employ qualitative constraints or rules to account for scoping preferences. This paper outlines a feature-based parsing algorithm for a grammar with multiple simultaneous levels of representation, one of which corresponds to a partial ordering among quantifiers according to scope. The optimal such ordering (as well as the ranking of other orderings) is determined in this grammar not by absolute constraints, but by stochastic heuristics based on the degree of alignment among the representational levels. A Prolog implementation is described and its accuracy is compared with that of other
منابع مشابه
Derived Trees Evolution for Tree Adjoining Grammars Parsing
Starting from the model proposed by means of Grammatical Evolution, we extended the applicability of the parallel and cooperative searching processes of Evolutionary Algorithms to a new topic, Tree Adjoining Grammars parsing. We evolved derived trees using a string-tree-representation. We also could use a linear matching function to compare the yield of a derived tree with a given input and the...
متن کاملSpecifying a shallow grammatical representation for parsing purposes
Is it possible to specify a grammatical representation (descriptors and their application guidelines) to such a degree that it can be consistently applied by different grammarians e.g. for producing a benchmark corpus for p.arser evaluation? Arguments for and against have been given, but very little empirical evidence. In this article we report on a double-blind experiment with a surfaceoriente...
متن کاملA Constructive Approach to Parsing with Neural Networks - The Hybrid Connectionist Parsing Method
The concept of Dynamic Neural Networks (DNN) is a new approach within the Neural Network paradigm, which is based on the dynamic construction of Neural Networks during the processing of an input. The DNN methodology has been employed in the Hybrid Connectionist Parsing (HCP) approach, which comprises an incremental, on-line generation of a Neural Network parse tree. The HCP ensures an adequate ...
متن کاملExact Grammaticality of Likely Parse Tree (Jugement exact de grammaticalité d'arbre syntaxique probable) [in French]
The robustness of probabilistic parsing generally comes at the expense of grammaticality judgment – the grammaticality of the most probable output parse remaining unknown. Parsers, such as the Stanford or the Reranking ones, can not discriminate between grammatical and ungrammatical probable parses, whether their surface realisations are themselves grammatical or not. In this paper we show that...
متن کاملA corpus-based connectionist architecture for large-scale natural language parsing
We describe a deterministic shift-reduce parsing model that combines the advantages of connectionism with those of traditional symbolic models for parsing realistic sub-domains of natural language. It is a modular system that learns to annotate natural language texts with syntactic structure. The parser acquires its linguistic knowledge directly from pre-parsed sentence examples extracted from ...
متن کامل